Phase Unwrapping via Graph Cuts

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge preserving phase unwrapping using graph cuts

This paper addresses the problem of recovering the absolute phase from modulo-2π phase, the so-called phase unwrapping (PU) problem. PU is a key step in several imaging technologies, namely, interferometric synthetic aperture radar (InSAR), and interferometric synthetic aperture sonar (InSAS). There, the topographic information is encoded in the phase of a complex valued image with a (different...

متن کامل

3D+time Left Ventricular Strain by Unwrapping Harmonic Phase with Graph Cuts

In previous work, a three-dimensional left ventricular strain throughout the cardiac cycle was reconstructed using a prolate spheroidal B-spline (PSB) method with displacement measurements obtained from unwrapped tagged MRI (tMRI) harmonic phase images. Manually placed branch cuts were required for each harmonic phase image to resolve phase inconsistencies and to guide the phase unwrapping (mSU...

متن کامل

Region Merging Via Graph-Cuts

In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of low boundaries. Our segmentation process merges regions of the watershed over-segmentation by minimizing a specific criteri...

متن کامل

PUMA: Phase Unwrapping via MAx flows

Phase unwrapping is the inference of absolute phase from modulo-2π phase. This paper synthetically presents an energy minimization framework for phase unwrapping. The considered objective functions are first-order Markov random fields. We provide an exact energy minimization algorithm, whenever the corresponding clique potentials are convex, namely for the phase unwrapping classical L norm, wit...

متن کامل

Multi-camera Scene Reconstruction via Graph Cuts

We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural generalization of the stereo matching problem. However, it is much more difficult than stereo, primarily due to the difficulty of reasoning about visibility. In this paper, we take an approach that has yielded excellent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Image Processing

سال: 2007

ISSN: 1057-7149

DOI: 10.1109/tip.2006.888351